Vectored-Bloom Filter for IP Address Lookup: Algorithm and Hardware Architectures
نویسندگان
چکیده
منابع مشابه
IP-Address Lookup Using Hardware Pipelining
Fast IP address lookup mechanism is a major design issue for the next generation routers. The existing scheme performs the IP address lookup by hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this article, we claim that with a little extra memory, it is able to further reduce the lookup time...
متن کاملIP Address Lookup in Hardware for High-Speed Routing
This paper presents a way of doing IP packet classification at high speed, a critical operation for highcapacity routers. Two hardware designs are presented, both based on simple, standard logic. One goal is that the designs should be inexpensive and simple enough that it is feasible to replicate them on each input port on a router. The first design is for unicast forwarding, based on destinati...
متن کاملEfficient Hardware Architecture for Fast IP Address Lookup
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forwarding table in order to determine the packet’s next-hop. In this paper, we present an efficient hardware solution for the IP address lookup problem. We model the address lookup problem as a searching problem on a binar...
متن کاملIP-address lookup using LC-tries
There has recently been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest is primarily motivated by the goal of building multi-Gb/s routers for the Internet, without having to rely on multi-layer switching techniques. We address this problem by using an LC-trie, a trie structure with combined path and level compression. This data s...
متن کاملUniversit a Di Pisa Ip Address Lookup Made Fast and Simple Ip Address Lookup Made Fast and Simple
The IP address lookup problem is one of the major bottlenecks in high performance routers. Previous solutions to this problem rst describe it in the general terms of longest preex matching and, then, are experimented on real routing tables T. In this paper, we follow the opposite direction. We start out from the experimental analysis of real data and, based upon our ndings, we provide a new and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2019
ISSN: 2076-3417
DOI: 10.3390/app9214621